package mo.leetcode_hot;

public class L198 {

    public int rob(int[] nums) {
        if (nums.length == 1) {
            return nums[0];
        }
        int[] dp = new int[nums.length];
        dp[0] = nums[0];
        dp[1] = Math.max(nums[0], nums[1]);
        int max = dp[1];
        for (int i = 2; i < nums.length; i++) {
            dp[i] = Math.max(dp[i-2]+nums[i], dp[i-1]);
            max = Math.max(dp[i], max);
        }
        return max;
    }

    public static void main(String[] args) {
        L198 test = new L198();
        System.out.println(test.rob(new int[]{1, 2, 3, 1}));
    }

}
